3-transposition group

In mathematical group theory, a 3-transposition group is a group generated by a class of involutions such that the product of any two has order at most 3. They were first studied by Bernd Fischer (1964, 1971) who discovered the three Fischer groups as examples of 3-transposition groups.

Contents

History

Fischer (1964) first studied 3-transposition groups in the special case when the product of any two transpositions has order 3. He showed that a finite group with this property is solvable, and has a (nilpotent) 3-group of index 2. Manin (1986) used these groups to construct examples of non-abelian CH-quasigroups and to describe the structure of commutative Moufang loops of exponent 3.

Fischer's theorem

Suppose that G is a group that is generated by conjugacy class of 3-transpositions and such that the 2 and 3 cores O2(G) and O3(G) are both contained in the center Z(G) of G and the derived group of G is perfect. Then Fischer (1971) proved that up to isomorphism G/Z(G) is one of the following groups and D is the image of the given conjugacy class:

If the condition that the derived group of G is perfect is dropped there are two extra cases:

The idea of the proof is as follows. Suppose that D is the class of 3-transpositions in G, and dD, and let H be the subgroup generated by the set Dd of elements of D commuting with d. Then Dd is a set of 3-transpositions of H, so the 3-transposition groups can be classified by induction on the order by finding all possibilities for G given any 3-transposition group H.

3-transpositions and graph theory

It is fruitful to treat 3-transpositions as vertices of a graph. Join the pairs that do not commute, i. e. have a product of order 3. The graph is connected unless the group has a direct product decomposition. The graphs corresponding to the smallest symmetric groups are familiar graphs. The 3 transpositions of S3 form a triangle. The 6 transpositions of S4 form an octahedron. The 10 transpositions of S5 form the complement of the Petersen graph.

The symmetric group Sn can be generated by n-1 transpositions: (12),(23), ..., (n-1,n) and the graph of this generating set is a straight line. It embodies sufficient relations to define the group Sn[1]..

References

  1. ^ L. E. Dickson, 'Linear Groups' (1900), p. 287.